Scheduling sets of composite applications with soft deadlines in time windows of heterogeneous computing environments
نویسندگان
چکیده
منابع مشابه
APPLICATIONS OF SOFT SETS IN HILBERT ALGEBRAS
The concept of soft sets, introduced by Molodtsov [20] is a mathematicaltool for dealing with uncertainties, that is free from the difficultiesthat have troubled the traditional theoretical approaches. In this paper, weapply the notion of the soft sets of Molodtsov to the theory of Hilbert algebras.The notion of soft Hilbert (abysmal and deductive) algebras, soft subalgebras,soft abysms and sof...
متن کاملapplications of soft sets in hilbert algebras
the concept of soft sets, introduced by molodtsov [20] is a mathematicaltool for dealing with uncertainties, that is free from the difficultiesthat have troubled the traditional theoretical approaches. in this paper, weapply the notion of the soft sets of molodtsov to the theory of hilbert algebras.the notion of soft hilbert (abysmal and deductive) algebras, soft subalgebras,soft abysms and sof...
متن کاملScheduling Resources in Multi-User, Heterogeneous, Computing Environments with SmartNet
It is increasingly common for computer users to have access to several computers on a network and hence to be able to execute many of their tasks on any of several computers The choice of which comput ers execute which tasks is commonly determined by users based on a knowledge of computer speeds for each task and the current load on each computer A number of task scheduling systems have been de...
متن کاملReal-Time Collaboration in Heterogeneous Computing Environments
The recent proliferation of computing devices and the contexts in which they are used demand diversity in collaborative applications as well. The objective of our research is to enable conferees to share applications that are adapted to their (heterogeneous) computing environments. This is achieved by using eXtensible Markup Language (XML) for the communication medium. The conferees share the s...
متن کاملOptimal Scheduling of Contract Algorithms with Soft Deadlines
A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupted throughout their execution, at which point they must report their current solution. Simulating interruptible algorithms by means of schedules of executions of contract algorithms in parallel processors is a wellstud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Izvestiâ vysših učebnyh zavedenij. Priborostroenie
سال: 2017
ISSN: 0021-3454
DOI: 10.17586/0021-3454-2017-60-4-295-301